package algorithm.leetcode.I401to600;

public class Q403 {
    public boolean canCross(int[] stones) {
        return false;
    }

    public static void main(String[] args) {
        Q403 fourZeroThree = new Q403();
        int[] a = {1,2,3};
        boolean res = fourZeroThree.canCross(a);
        System.out.println(res);
    }
}
